#define _CRT_SECURE_NO_WARNINGS 1

#include"BinarySearchTree.h"

int main()
{
	Key::BSTree<int> t;
	int a[] = { 8,3,1,10,6,4,7,14,13,16 };
	for (int i = 0; i < 10; i++)
	{
		t.Insert2(a[i]);
	}
	t.InOrder();

	Key::BSTree<int> t1 = t;
	t1.InOrder();

	t = t1;
	t.InOrder();

	return 0;
}